A matrix decision procedure for three modal logics.
نویسندگان
چکیده
منابع مشابه
Resolution Is a Decision Procedure for Many Propositional Modal Logics
The paper shows satissability in many propositional modal systems, including K, KD, KT and KB, their combinations as well as their multi-modal versions, can be decided by ordinary resolution procedures. This follows from a general result that resolution and condensing is a decision procedure for the satissability problem of formulae in so-called path logics. Path logics arise from propositional...
متن کاملBuilding Decision Procedures for Modal Logics from Propositional Decision Procedure - The Case Study of Modal K
The goal of this paper is to propose a new technique for developing decision procedures for propositional modal logics. The basic idea is that propositional modal decision procedures should be developed on top of propositional decision procedures. As a case study, we describe an algorithm, based on an implementation of the Davis-Putnam-Longemann-Loveland procedure, which tests satissability in ...
متن کاملOn Modal Decision Logics
Some modal decision logic languages are proposed for knowledge representation in data mining through the notions of models and satisfiability. The models are collections of data tables consisting of a finite set of objects described by a finite set of attributes. Some relationships may exist between data tables in a collection and the modalities of our languages are interpreted with respect to ...
متن کاملResolution Is a Decision Procedure for Many Propositional Modal Logics (extended Abstract)
abstract. The paper shows satissability in many propositional modal systems, including K, KD, KT and KB, their combinations as well as their multi-modal versions, can be decided by ordinary resolution procedures. This follows from a general result that resolution and condensing is a decision procedure for the satissability problem of formulae in so-called path logics. Path logics arise from pro...
متن کاملMatrix Proof Methods for Modal Logics
We present matrix proof systems for both constantand varying-domain versions of the first-order modal logics K, K4, D, D4, T, 84 and 86 based on modal versions of Herbrand's Theorem specifically formulated to support efficient automated proof search. The systems treat the mil modal language (no normal-forming) and admit straightforward structure sharing implementations. A key fsature of our app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1979
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093882665